Compressed Sensing, Group Testing and Matrix Completion in a Nutshell

نویسنده

  • Aaditya Ramdas
چکیده

Compressed sensing of sparse signals is a field that has become pervasive over the last decade, with interesting and strong theoretical guarantees, as well as practical applications across fields. The group testing problem arose several decades earlier in the context of blood testing for syphilis where very few patients had the disease and it was too expensive to test everyone independently. Matrix completion arises naturally in many applications due to incomplete available information. These problems share a lot of ideas, and in this survey we aim to pose the problems in a common framework and discuss the relations between them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

Estimation of missing RTTs in computer networks: Matrix completion vs compressed sensing

1389-1286/$ see front matter 2011 Elsevier B.V doi:10.1016/j.comnet.2011.07.003 ⇑ Corresponding author. E-mail addresses: [email protected] (Z. Dong edu (S. Anand), [email protected] (R. Chandramou We estimate the missing round trip time (RTT) measurements in computer networks using doubly non-negative (DN) matrix completion and compressed sensing. The major contributions of this paper are t...

متن کامل

Spectral Clustering with Compressed, Incomplete and Inaccurate Measurements

Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged as prevailing methods for efficiently recovering sparse and partially observed signals respectively. We combine the distance preserving measurements of compressed sensing and matrix completion with the power of robust s...

متن کامل

Supplemental Materials for “ Spectral Compressed Sensing via Structured Matrix Completion ”

This supplemental document presents details concerning analytical derivations that support the theorems made in the main text " Spectral Compressed Sensing via Structured Matrix Completion " , accepted to the 30th International Conference on Machine Learning (ICML 2013). One can find here the detailed proof of Theorems 1-3.

متن کامل

Two Algorithms on Matrix Completion and Compressed Sensing

Compressed Sensing and Matrix Completion, two fields existing for decades, recently led by Emmanuel Candès, Terrence Tao and David L. Donoho, are becoming one of the most active researching areas in computational harmonic analysis. The fundamental principle of Compressed Sensing is that, through optimization, the sparsity of f ∈ RN , with N ∈ N an unknown but supposed to be compressible signal,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012